LeetCode 153. Find Minimum in Rotated Sorted Array。

解答1[Java]：

class Solution {
  public int findMin(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }

        int min = nums[0];

        for (int i = 1; i < nums.length; ++i) {
            if (nums[i] < min) {
                return nums[i];
            }
        }

        return min;
  }
}